Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms
نویسندگان
چکیده
منابع مشابه
Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms
Taking advantage of the power of DNA molecules to spontaneously form hairpin structures, Sakamoto et al. designed a molecular algorithm to solve instances of the satis1ability problem on Boolean expressions in clausal form (the SAT problem), and by developing new experimental techniques for molecular biology, they succeeded in solving a 6-variable, 10-clause instance of the 3-SAT problem (Sakam...
متن کاملDISTANCE-SAT: Complexity and Algorithms
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositional framework. The decision problem DISTANCE-SAT that consists in determining whether a propositional CNF formula admits a model that disagrees with a given partial interpretation on at most d variables, is introduced. ...
متن کاملProbabilistic complexity analysis of incremental DFT algorithms
We present a probabilistic complexity analysis of a class of multi-stage algorithms for computing successive approximations to the DFT. While the quality of the approximate spectra obtained after any stage of these algorithms can be readily quanti ed in terms of commonly used inputindependent metrics of spectral quality, each stage's arithmetic complexity is dependent on the nature of the input...
متن کاملConnecting SAT Algorithms and Complexity Lower Bounds
I will describe prior and current work on connecting the art of finding good satisfiability algorithms with the art of proving complexity lower bounds: proofs of limitations on what problems can be solved by good algorithms. Surprisingly, even minor algorithmic progress on solving the circuit satisfiability problem faster than exhaustive search can be applied to prove strong circuit complexity ...
متن کاملProbabilistic Algorithms and Complexity Classes
The main theme in this dissertation is a computation on a probabilistic Turing machine (PTM), which is a Turing machine with distinguished states called coin-tossing states. In general, it is assumed that a PTM has a fair coin. This is led by that any xed biased coin can simulate another xed biased coin in a constant expected time. We rst consider the computation which will always terminates in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00095-6